EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
نویسندگان
چکیده
منابع مشابه
Exact quantum Fourier transforms and discrete logarithm algorithms
We show how the quantum fast Fourier transform (QFFT) can be made exact for arbitrary orders (first for large primes). For most quantum algorithms only the quantum Fourier transform of order 2n is needed, and this can be done exactly. Kitaev [9] showed how to approximate the Fourier transform for any order. Here we show how his construction can be made exact by using the technique known as “amp...
متن کاملNew fast algorithms of multidimensional Fourier and Radon discrete transforms
This paper describes a fast new n{D Discrete Radon Transform (DRT) and a fast exact inversion algorithm for it, without interpolating from polar to Cartesian coordinates or using the backprojection operator. New approach is based on the fast Nussbaumer's Polynomial Transform (NPT).
متن کاملDiscrete–time Fourier Series and Fourier Transforms
We now start considering discrete–time signals. A discrete–time signal is a function (real or complex valued) whose argument runs over the integers, rather than over the real line. We shall use square brackets, as in x[n], for discrete–time signals and round parentheses, as in x(t), for continuous–time signals. This is the notation used in EECE 359 and EECE 369. Discrete–time signals arise in t...
متن کاملDiscrete–time Fourier Series and Fourier Transforms
We now start considering discrete–time signals. A discrete–time signal is a function (real or complex valued) whose argument runs over the integers, rather than over the real line. We shall use square brackets, as in x[n], for discrete–time signals and round parentheses, as in x(t), for continuous–time signals. This is the notation used in EECE 359 and EECE 369. Discrete–time signals arise in t...
متن کاملFast and stable algorithms for discrete spherical Fourier transforms
In this paper, we propose an algorithm for the stable and eecient computation of Fourier expansions of square integrable functions on the unit sphere S R 3 , as well as for the evaluation of these Fourier expansions at special knots. The heart of the algorithm is an eecient realization of discrete Legendre function transforms based on a modiied and stabilized version of the Driscoll{Healy algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Quantum Information
سال: 2004
ISSN: 0219-7499,1793-6918
DOI: 10.1142/s0219749904000109